High-speed VLSI architecture for parallel Reed-Solomon decoder
نویسنده
چکیده
This paper presents high-speed parallel Reed–Solomon (RS) (255,239) decoder architecture using modified Euclidean algorithm for the high-speed multigigabit-per-second fiber optic systems. Pipelining and parallelizing allow inputs to be received at very high fiber-optic rates and outputs to be delivered at correspondingly high rates with minimum delay. Parallel processing architecture results in speed-ups of as much as or more than 10 Gb, since the maximum achievable clock frequency is generally bounded by the critical path of the modified Euclidean algorithm block. The parallel RS decoders have been designed and implemented with the 0.13m CMOS standard cell technology in a supply voltage of 1.1 V. It is suggested that a parallel RS decoder, which can keep up with optical transmission rates, i.e., 10 Gb/s and beyond, could be implemented. The proposed channel = 4 parallel RS decoder operates at a clock frequency of 770 MHz and has a data processing rate of 26.6 Gb/s.
منابع مشابه
Algorithm-Based Low-Power/High-Speed Reed–Solomon Decoder Design
With the spread of Reed–Solomon (RS) codes to portable wireless applications, low-power RS decoder design has become important. This paper discusses how the Berlekamp Massey Decoding algorithm can be modified and mapped to obtain a low-power architecture. In addition, architecture level modifications that speed-up the syndrome and error computations are proposed. Then the VLSI architecture and ...
متن کاملLow Power/High Speed design of a Reed Solomon Decoder
OF T H E PAPER With the spread of Reed Solomon codes t o portable applications, low power RS decoder design has become important. This paper discusses how the Berlekamp Massey Decoding algorithm can be modified in order t o obtain a low power architecture. In addition, modifications thut speed-up the syndrome and error computations are suggested. T h e n the VLSI design of a low power/high spee...
متن کاملA Vlsi Architecture for Interpolation in Soft-decision List Decoding of Reed-solomon Codes
The Koetter-Vardy algorithm is an algebraic soft-decision decoder for Reed-Solomon codes which is based on the Guruswami-Sudan list decoder. There are three main steps: 1) multiplicity calculation, 2) interpolation and 3) root finding. The Koetter-Vardy algorithm is challenging to implement due to the high cost of interpolation. We propose a VLSI architecture for interpolation that uses a trans...
متن کاملA High Speed VLSI Architecture of a Pipelined Reed Solomon Encoder for Data Storage in Communication Systems
21 st century is an era of wireless world. The cause of the current trend for wireless applications is the improved data rate for multifarious applications of communication. But during communication, the data might be distorted due to impairments of channels. Reduction of error due to noisy channels becomes critical. Novel high speed VLSI architecture for encoding Reed Solomon codes are present...
متن کاملHigh-speed decoder of Reed-Solomon codes
A high speed decoding algorithm using a modified step-by-step method for t-error-correcting Reed-Solomon codes is introduced. Based on this algorithm, a sequential decoder and a vector decoder are then proposed. These two decoders can be constructed by four basic modules: the syndrome calculation module, the comparison module, the decision module, and the shift-control module. These decoders ca...
متن کامل